Message scheduling with reduced matrix cycle and evenly distributed sparse allocation for time-triggered CAN
نویسنده
چکیده
Controller Area Network (CAN) was initially developed as an in-vehicle real-time communication bus. Due to its low cost and high reliability, it has also become a widely accepted standard in industrial distributed control applications. The CAN protocol has an event-triggered architecture. Although its priority based medium access mechanism provides guaranteed immediate access for the highest priority messages, it may cause unpredictability in communication media for the lower priority messages. In order to address the problems caused by the event-triggered architecture, different timetriggered network architectures, such as TTP, Byteflight, and Flexray, have been introduced. This paper focuses on time-triggered CAN (TTCAN), which is built on the existing CAN standard with the addition of time division multiple access (TDMA). In order to combine the advantages of the eventtriggered and time-triggered communication to meet the requirements of the distributed real-time systems, it is crucial to construct feasible message schedules. In this study, a schedule construction method, based on the reduced matrix cycle and evenly distributed sparse allocation, is introduced to produce the best optimum message schedules possible in terms of the message delay performance. The simulation results show that the method introduced in this study provides significant performance improvement not only for the time-triggered messages but also for the event-triggered messages. & 2011 Elsevier Ltd. All rights reserved.
منابع مشابه
Budgetary Constraints and Idle Time Allocation in Common-Cycle Production with non-zero Setup Time
Economic lot size scheduling problem (ELSP) for a multi-product single machine system is a classical problem. This paper considers ELSP with budgetary constraint as an important aspect of such systems. In the real world situations the available funds for investment in inventory is limited. By adopting the common cycle time approach to ELSP, we obtain the optimal common cycle which minimizes the...
متن کاملSparse Matrix-Vector Multiplication for Circuit Simulation
Sparse Matrix-Vector Multiplication (SpMV) plays an important role in numerical algorithm in circuit simulation. In this report, we utilize Message Passing Interface (MPI) to parallelize the SpMV. In addition, resulting from the circuit simulation matrix formulation, the circuit systems are often represented as unstructured, not evenly-distributed sparse matrices. Therefore, we automatically de...
متن کاملIntegrated modeling and solving the resource allocation problem and task scheduling in the cloud computing environment
Cloud computing is considered to be a new service provider technology for users and businesses. However, the cloud environment is facing a number of challenges. Resource allocation in a way that is optimum for users and cloud providers is difficult because of lack of data sharing between them. On the other hand, job scheduling is a basic issue and at the same time a big challenge in reaching hi...
متن کاملCoherent load information mechanisms for distributed dynamic scheduling
We consider a distributed system where processes can only communicate by message passing and need a coherent view of the load (e.g., workload, memory) of others to take dynamic decisions (scheduling). We present several mechanisms to obtain distributed estimates of such information and experiment them in the context of a real application, an asynchronous parallel solver for large sparse systems...
متن کاملMessage passing for task redistribution on sparse graphs
The problem of resource allocation in sparse graphs with real variables is studied using methods of statistical physics. An efficient distributed algorithm is devised on the basis of insight gained from the analysis and is examined using numerical simulations, showing excellent performance and full agreement with the theoretical results.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Network and Computer Applications
دوره 34 شماره
صفحات -
تاریخ انتشار 2011